Low Congested Interval Routing Schemes

Static and Dynamic Low-Congested Interval Routing Schemes

Low-congested interval routing schemes for hypercubelike networks

In this paper we provide low-congested Interval Routing Schemes (IRS) for some common interconnection networks such as butterflies, wrapped butterflies and cube connected cycles. In particular, by exploiting their hypercube-like structure, we show that 1-IRS and 2-IRS are already sufficient to get schemes with a congestion which is at most c times the optimal one, for low constant values of c. ...

Static and Dynamic Low-Congested Interval Routing Schemes

Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have practical applications, as they have been implemented with wormhole routing in the last generation of INMOS Transputer Router Chips. In this paper we consider IRS that are optimal with respect to the congestion of the...

Linear Interval Routing

We study a variant of Interval Routing SK85, LT86] where the routing range associated with every link is represented by a linear (i.e., contiguous) interval with no wrap around. This kind of routing schemes arises naturally in the study of dynamic Preex Routing BLT90]. Linear Interval Routing schemes are precisely the Preex Routing schemes that use an alphabet of one symbol. We characterize the...

Compact Routing on Chordal Rings of Degree Four yLata

A chordal ring G(n; c) of degree 4 is a ring of n nodes with chords connecting each vertex i to the vertex (i + c) mod n. In this paper, we investigate compact routing schemes on such networks. We show a routing scheme for any such network that requires O(log n) bits of storage at each node, and O(1) time to compute a shortest path to any destination. This improves on the results of 16] which g...